JZ8 跳台阶

https://www.nowcoder.com/practice/8c82a5b80378478f9484d87d1c5f12a4

public class Solution {
    //HashMap<Integer, Integer> cache = new HashMap<>();
    // 斐波那契数列
    public int jumpFloor(int target) {
        if (target < 3) return target;
        
        int result = 0;
        int pre = 1;
        int next = 2;
        // 动态规划
        for(int i = 3; i < target + 1; i++) {
            result = pre + next;
            pre = next;
            next = result;
        }
        
        return result;
    }
}

使用递归的方式最简单

func jumpFloor( number int ) int {
    if number <= 1 {
        return 1
    }
    return jumpFloor(number - 1) + jumpFloor(number - 2)
}